Several Classes of (2m - 1, w, 2) Optical Orthogonal Codes
نویسندگان
چکیده
Optical orthogonal codes have applications in optical code-division multiple access communication systems and other wide band code-division multiple environments. They can also be used to construct protocol sequences for multiuser collision channel without feedback, and constant weight codes for error detection and correction. In this paper, we construct four classes of (2 − 1; w; 2) cyclotomic optical orthogonal codes, where w∈{5; 9} or w¿ 11 is any prime having primitive root 2, and therefore the corresponding classes of binary constant-weight cyclic codes. ? 2003 Elsevier Science B.V. All rights reserved.
منابع مشابه
Geometric constructions of optimal optical orthogonal codes
We provide a variety of constructions of (n,w, λ)-optical orthogonal codes using special sets of points and Singer groups in finite projective spaces. In several of the constructions, we are able to prove that the resulting codes are optimal with respect to the Johnson bound. The optimal codes exhibited have λ = 1, 2 and w − 1 (where w is the weight of each codeword in the code). The remaining ...
متن کاملOptimal ternary cyclic codes with minimum distance four and five
Cyclic codes are an important subclass of linear codes and have wide applications in data storage systems, communication systems and consumer electronics. In this paper, two families of optimal ternary cyclic codes are presented. The first family of cyclic codes has parameters [3m−1,3m−1−2m,4] and contains a class of conjectured cyclic codes and several new classes of optimal cyclic codes. The ...
متن کامل2-dimensional Optical Orthogonal Codes from Singer Groups
We present several new families of (Λ × T,w, λ) (2-D) wavelength/time optical orthogonal codes (2D-OOCs) with λ = 1, 2. All families presented are either optimal with respect to the Johnson bound (J-optimal) or are asymptotically optimal. The codes presented have more flexible dimensions and weight than the J-optimal families appearing in the literature. The constructions are based on certain p...
متن کاملOn the nonexistence of $[\binom{2m}{m-1}, 2m, \binom{2m-1}{m-1}]$, $m$ odd, complex orthogonal design
Complex orthogonal designs (CODs) are used to construct space-time block codes. COD Oz with parameter [p, n, k] is a p × n matrix, where nonzero entries are filled by ±zi or ±z ∗ i , i = 1, 2, . . . , k, such that O H z Oz = (|z1| 2 + |z2| 2 + . . . + |zk| 2)In×n. Adams et al. in “The final case of the decoding delay problem for maximum rate complex orthogonal designs,” IEEE Trans. Inf. Theory,...
متن کاملNew Wavelength-Time Codes for High Speed Optical CDMA Networks
Optical code-division multiple access (OCDMA) is a promising solution and it provides secure and asynchronous transmission in optical networks. Since high statistical multiplexing gain can be offered even in bursty traffic, OCDMA techniques are very suitable for access networks [1-3]. To reduce the code lengths, traditional one-dimensional time-spreading codes such as optical orthogonal codes (...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 128 شماره
صفحات -
تاریخ انتشار 2001